Analytical Solutions For the Ray Perturbation In Depth-Varying Media
نویسندگان
چکیده
منابع مشابه
Analytical solutions for the fractional Fisher's equation
In this paper, we consider the inhomogeneous time-fractional nonlinear Fisher equation with three known boundary conditions. We first apply a modified Homotopy perturbation method for translating the proposed problem to a set of linear problems. Then we use the separation variables method to solve obtained problems. In examples, we illustrate that by right choice of source term in the modified...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولAnalytical solutions for the fractional Klein-Gordon equation
In this paper, we solve a inhomogeneous fractional Klein-Gordon equation by the method of separating variables. We apply the method for three boundary conditions, contain Dirichlet, Neumann, and Robin boundary conditions, and solve some examples to illustrate the effectiveness of the method.
متن کاملanalytical solutions for the fractional nonlinear telegraph equation using a modified homotopy perturbation and separation of variables methods
in this paper, first a new homotopy perturbation method for solving a fractional order nonlinear telegraph equation is introduced. by applying the proposed method, the nonlinear equation is translated to linear equations for per iteration of homotopy perturbation method. then, the obtained problems are solved with separation method. in the examples, it is illustrated that the exact solution is ...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geophysical Journal International
سال: 1993
ISSN: 0956-540X,1365-246X
DOI: 10.1111/j.1365-246x.1993.tb03916.x